Visualizing Quickest Visibility Maps
نویسنده
چکیده
Consider the following modification to the shortest path query problem in polygonal domains: instead of finding shortest path to a query point q, we find the shortest path to any point that sees q. We present an interactive visualization applet visualizing these quickest visibility paths. The applet also visualizes quickest visibility maps, that is the subdivision of the domain into cells by the quickest visibility path structure. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling
منابع مشابه
Visualizing Global Cyberscapes: Mapping User-Generated Placemarks
This article focuses on the representation of physical places on the Internet or what we term cyberscape. While there is a wide range of online place-related information available, this project uses the metric of the number of user-generated Google Maps placemarks containing specific keywords in locations worldwide. After setting out the methods behind this research, this article provides a car...
متن کاملThe 3D rRNA modification maps database: with interactive tools for ribosome analysis
The 3D rRNA modification maps database is the first general resource of information about the locations of modified nucleotides within the 3D structure of the full ribosome, with mRNA and tRNAs in the A-, P- and E-sites. The database supports analyses for several model organisms, including higher eukaryotes, and enables users to construct 3D maps for other organisms. Data are provided for human...
متن کاملQuickest Visibility Queries in Polygonal Domains
Let s be a point in a polygonal domain P of h−1 holes and n vertices. We consider the following quickest visibility query problem. Given a query point q in P, the goal is to find a shortest path in P to move from s to see q as quickly as possible. Previously, Arkin et al. (SoCG 2015) built a data structure of size O(n22α(n) logn) that can answer each query in O(K log2 n) time, where α(n) is the...
متن کاملCross-fringe versus single-fringe probabilities
High-resolution TEM is well-suited to characterizing nanocrystals, where lattice fringes serve as a source of structural information [1, 2]. For example, 3D lattice parameters can be measured from 2D lattice fringe images taken at as few as two different specimen orientations [3-6]. Recent work has shown that lattice fringe-visibility maps, a thin-specimen extension of bend-contour and channeli...
متن کاملEdge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths
In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of possible directions over the grid. Visibility Graphs are a known optimal algorithm for solving the problem with the use of preprocessing. However, Visibility Graphs are known to perform poorly in terms of running time, es...
متن کامل